#define _CRT_SECURE_NO_WARNINGS 1
#include"BinarySearchTree.h"

int main()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> bt;
	for (auto e : a)
	{
		if (e == 4)
		{
			int a = 0;
		}
		bt.Insert(e);
		//cout << e << " ";

	}
	/*bt.Insert(8);
	bt.Insert(10);*/
	int n = 10;
	cout << bt.Find(n) << endl;;
	bt.InOrder();
	return 0;
}